On the properties of cycles of simple Boolean networks

摘要

We study two types of simple Boolean networks, namely two loops with across-link and one loop with an additional internal link. Such networks occuras relevant components of critical K=2 Kauffman networks. We determine mostlyanalytically the numbers and lengths of cycles of these networks and find manyof the features that have been observed in Kauffman networks. In particular,the mean number and length of cycles can diverge faster than any power law.